Exploring a shortest path problem using an ant colony algorithm
نویسنده
چکیده
In this paper, we present an ant algorithm applied to a shortest path problem. The algorithm will consider different input parameters in order to see how the results behave. These results will be compared to see if there is a pattern on changing the input parameters.
منابع مشابه
Finding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملLoad Balancing Using a Best-Path-Updating Information-Guided Ant Colony Optimization Algorithm
Abstract: Load balancing and phase balancing are important complement to reconfiguration of the feeder and the network.In the distribution automation ,these issues must be solved continuously and simultaneously to ensure the optimal performance of a distribution network.Distribution network imbalance has various consequences such as increase in power losses, voltage drop,cost increase,etc.In th...
متن کاملWelding Path Planning of welding Robot Based on Improved Ant Colony Algorithm
The basic ant colony algorithm in the welding robot path planning, in the search process, prone to search for too long, low efficiency, easy to fall into the local optimal and other issues. In this paper, the basic ant colony algorithm is improved, and the Adadelta algorithm is introduced. By combining the basic ant colony algorithm and Adadelta algorithm, the probability of selecting the next ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006